// #include <vector>
// #include <unordered_set>
// #include <iostream>
// #include <unordered_unordered_set>
#include <bits/stdc++.h>
using namespace std;

int main()
{
    vector<pair<int, int>> a = {{1, 1}, {2, 2}};
    a[1].second = 1;
    cout << a[1].first << ", " << a[1].second << endl;

    set<int> b = {4, 3};
    vector<int> c;
    unordered_set<int> d = {1, 1, 2, 5, 6, 9, 9};

    b.insert(1);
    b.insert(2);
    b.insert(1);
    d.insert(3);

    for (set<int>::iterator it = b.begin(); it != b.end(); it++)
    {
        cout << *it << ", ";
    }
    cout << endl;
    for (auto &it : b)
    {
        cout << it << ", ";
    }
    cout << endl;
    for (set<int>::iterator it = b.begin(); it != b.end(); it++)

    {
        c.push_back(*it);
    }
    for (vector<int>::iterator it = c.begin(); it != c.end(); it++)
    {
        cout << *it << ", ";
    }
    cout << endl;
    cout << typeid(1 < 2).name() << endl;

    for (auto &it : d)
    {
        cout << it << ", ";
    }
    return 0;
}